Network Embedding Using Deep Robust Nonnegative Matrix Factorization
نویسندگان
چکیده
منابع مشابه
Sparse Deep Nonnegative Matrix Factorization
Nonnegative matrix factorization is a powerful technique to realize dimension reduction and pattern recognition through single-layer data representation learning. Deep learning, however, with its carefully designed hierarchical structure, is able to combine hidden features to form more representative features for pattern recognition. In this paper, we proposed sparse deep nonnegative matrix fac...
متن کاملRobust near-separable nonnegative matrix factorization using linear optimization
Nonnegative matrix factorization (NMF) has been shown recently to be tractable under the separability assumption, which amounts for the columns of the input data matrix to belong to the convex cone generated by a small number of columns. Bittorf, Recht, Ré and Tropp (‘Factoring nonnegative matrices with linear programs’, NIPS 2012) proposed a linear programming (LP) model, referred to as HottTo...
متن کاملAnalysis of two-mode network data using nonnegative matrix factorization
Nonnegative matrix factorization has been offered as a fast and effective method for analyzing nonnegative two-mode proximity data. The goal is to structurally represent a nonnegative proximity matrix as the product of two lower-dimensional nonnegative matrices. Goodness of fit is typically measured as the sum of the squared deviations between the observed matrix elements and the estimated elem...
متن کاملProjective robust nonnegative factorization
Nonnegative matrix factorization (NMF) has been successfully used in many fields as a low-dimensional representation method. Projective nonnegative matrix factorization (PNMF) is a variant of NMF that was proposed to learn a subspace for feature extraction. However, both original NMF and PNMF are sensitive to noise and are unsuitable for feature extraction if data is grossly corrupted. In order...
متن کاملDocument clustering using nonnegative matrix factorization
Amethodology for automatically identifying and clustering semantic features or topics in a heterogeneous text collection is presented. Textual data is encoded using a low rank nonnegative matrix factorization algorithm to retain natural data nonnegativity, thereby eliminating the need to use subtractive basis vector and encoding calculations present in other techniques such as principal compone...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2992269